To “ Optimization via Low - Rank Approximation , with Applications to Community Detection in Networks ”
نویسندگان
چکیده
5.1. Proof of results in Section 3.1. Under degree-corrected block models, let us denote by Ā the conditional expectation of A given the degree parameters θ = (θ1, ..., θn) T . Note that if θi ≡ 1 then Ā = EA. Since Ā depends on θ, its eigenvalues and eigenvectors may not have a closed form. Nevertheless, we can approximate them using ρi and ūi from Lemma 3. To do so, we need the following lemma.
منابع مشابه
Optimization via Low-rank Approximation, with Applications to Community Detection in Networks
Community detection is one of the fundamental problems of network analysis. A number of methods for community detection have been proposed, including spectral clustering, modularity, and likelihoodbased methods. Most of these methods have to solve an optimization problem over a discrete set of labels, which is computationally infeasible. Some fast algorithms have been proposed for specific meth...
متن کاملSTRUCTURAL DAMAGE DETECTION BY MODEL UPDATING METHOD BASED ON CASCADE FEED-FORWARD NEURAL NETWORK AS AN EFFICIENT APPROXIMATION MECHANISM
Vibration based techniques of structural damage detection using model updating method, are computationally expensive for large-scale structures. In this study, after locating precisely the eventual damage of a structure using modal strain energy based index (MSEBI), To efficiently reduce the computational cost of model updating during the optimization process of damage severity detection, the M...
متن کاملUtilizes the Community Detection for Increase Trust using Multiplex Networks
Today, e-commerce has occupied a large volume of economic exchanges. It is known as one of the most effective business practices. Predicted trust which means trusting an anonymous user is important in online communities. In this paper, the trust was predicted by combining two methods of multiplex network and community detection. In modeling the network in terms of a multiplex network, the relat...
متن کاملA Multiagent Reinforcement Learning algorithm to solve the Community Detection Problem
Community detection is a challenging optimization problem that consists of searching for communities that belong to a network under the assumption that the nodes of the same community share properties that enable the detection of new characteristics or functional relationships in the network. Although there are many algorithms developed for community detection, most of them are unsuitable when ...
متن کاملOverlapping Community Detection in Social Networks Based on Stochastic Simulation
Community detection is a task of fundamental importance in social network analysis. Community structures enable us to discover the hidden interactions among the network entities and summarize the network information that can be applied in many applied domains such as bioinformatics, finance, e-commerce and forensic science. There exist a variety of methods for community detection based on diffe...
متن کامل